Heat & Dump: Competitive Distributed Paging
نویسندگان
چکیده
This paper gives a randomized competitive distributed paging algorithm called Heat & Dump. The competitive ratio is logarithmic in the total storage capacity of the network, this is optimal to within a constant factor. This is in contrast to the linear optimal deterministic competitive ratio BFR].
منابع مشابه
Competitive Analysis of Paging: A Survey
This paper is a survey of competitive analysis of paging. We present proofs showing tight bounds for the competitive ratio achievable by any deterministic or randomized online algorithm. We then go on to discuss variations and reenements of the competitive ratio and the insights they give into the paging problem. Finally, we variations to the online paging problem to which competitive analysis ...
متن کاملBroadcast Disk Paging with a Small Cache
We consider the broadcast disk paging problem when the cache size is 2 and n pages are transmitted. We show an algorithm that is (n 2=(n 2))-competitive and prove that no better competitive ratio is possible.
متن کاملImproved Space Bounds for Strongly Competitive Randomized Paging Algorithms
Paging is a prominent problem in the field of online algorithms. While in the deterministic setting there exist simple and efficient strongly competitive algorithms, in the randomized setting a tradeoff between competitiveness and memory is still not settled. In this paper we address the conjecture in [2], that there exist strongly competitive randomized paging algorithms using o(k) bookmarks, ...
متن کاملMemory Forensics for QQ from a Live System
Our paper details the techniques to collect sensitive information of the QQ client, which is the most popular instant messaging (IM) in China. We have managed to acquire the contact list, the QQ account, the chats records, the QQ discussion group, the display names and the contents of network notepad. They are of great interest to the examiners. Besides, as the techniques we use to search for p...
متن کاملA Simple Analysis for Randomized Online Weighted Paging
We describe a new potential function based proof for anO(log k)-competitive algorithm for weighted paging, and more generally anO(log k/(k−h+1))-competitive algorithm for the weighted (h, k)-paging problem. In contrast to previous results that are based on the online primal-dual framework, our analysis is extremely simple, and we believe that the technique might be useful in the analysis of oth...
متن کامل